Reliable Multi-Path Provisioning for High-Capacity Backbone Mesh Network
نویسندگان
چکیده
We investigate reliable multi-path provisioning of traffic in high-capacity backbone mesh networks, e.g., nextgeneration SONET/SDH networks supporting virtual concatenation (VCAT). VCAT enables a connection to be inversely multiplexed on to multiple paths, a feature that may lead to significantly improved performance over conventional single-path provisioning. Other mesh networks such as those employing optical wavelength-division multiplexing (WDM) and multi-protocol label switching (MPLS) can also benefit from this multi-path provisioning approach. We propose effective multi-path bandwidth as the metric to provision a connection while satisfying its reliability requirements (measured in terms of availability). We demonstrate that effective multi-path bandwidth provides more flexibility and lower blocking probability without the cost and the complexity associated with traditional protection schemes developed for optical WDM and MPLS networks. We also investigate the practical problem of provisioning effective multi-path bandwidth with cost constraints. We analyze the tractability of the problem and present a heuristic which results in significantly reduced number of blocked connections due to cost constraints. Index Terms virtual concatenation, multi-path provisioning, flexible provisioning, degraded service, effective multi-path bandwidth, multi-constrained paths.
منابع مشابه
Comparative Analysis of Multipath Protection Algorithms for SONET/SDH
or High capacity backbone mesh network (Synchronous Optical Network/Synchronous Digital Hierarchy) a multipath provisioning system has been investigated and designed. The algorithm is suitable for the VCAT like issues. The work has been done to support the SONET/SDH network using the dedicated path protection and Shared Path protection schemes. The enhancement has been done in the Dedicated and...
متن کاملTraffic Engineering in Multi-Granularity, Heterogeneous, WDM Optical Mesh Networks Through Dynamic Traffic Grooming
In this paper, we investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic-grooming schemes under traffic-engineering (TE) principles. Due to the huge amount of traffic a WDM backbone network can support and the large geographic area it can cover, constructing and upgrading such an optical WD...
متن کاملResource Optimization Scheme for Multimedia-Enabled Wireless Mesh Networks
Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutil...
متن کاملDynamic Routing with Partial Information in Mesh-Restorable Optical Networks
Changing trends in backbone transport networks towards dynamic path provisioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks. Several methods have been proposed for joint optimization of working and spare capacity in survivable optical networks. These techniques are centralized an...
متن کاملAvailability-Guaranteed Service Provisioning Employing a Generalized Path-Protection Model in WDM Networks
Traffic grooming deals with efficiently packing/unpacking low-speed connections onto high-capacity trunks. We examine traffic grooming for optical mesh networks by reviewing grooming-node architectures, traffic models, grooming policies, novel graph models, survivable grooming, and hierarchical switching, etc. @2003 Optical Society of America OCIS codes: (060.4250) Networks; (060.4510) Optical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005